From I/O Automata to Timed I/O Automata
نویسندگان
چکیده
The model of timed I/O automata represents an extension of the model of I/O automata with the aim of reasoning about realtime systems. A number of case studies using timed I/O automata has been carried out, among them a treatment of the so-called Generalized Railroad Crossing (GRC). An already existing formalization of the metatheory of I/O automata within Isabelle/HOLCF allows for fully formal tool-supported verification using I/O automata. We present a modification of this formalization which accomodates for reasoning about timed I/O automata. The guiding principle in choosing the parts of the metatheory of timed I/O automata to formalize has been to provide all the theory necessary for formalizing the solution to the GRC. This leads to a formalization of the GRC, in which not only the correctness proof itself has been formalized, but also the underlying meta-theory of timed I/O automata, on which the correctness proof is based.
منابع مشابه
Input/Output Automata: Basic, Timed, Hybrid, Probabilistic, Dynamic,
The term Input/Output Automata refers to a family of system modeling frameworks based on interacting infinite-state machines. The models come in several flavors, based on which features (fairness, time, continuous behavior, probability, etc.) they can express. In each of these frameworks, automata can be composed in parallel to form more complex automata, and automata can be related using level...
متن کاملTimed I/O Automata: A Mathematical Framework for Modeling and Analyzing Real-Time Systems
We describe the Timed Input/Output Automata (TIOA) framework, a general mathematical framework for modeling and analyzing real-time systems. It is based on timed I/O automata, which engage in both discrete transitions and continuous trajectories. The framework includes a notion of external behavior, and notions of composition and abstraction. We define safety and liveness properties for timed I...
متن کاملDecomposing Verification of Timed I/O Automata
This paper presents assume-guarantee style substitutivity results for the recently published timed I/O automaton modeling framework. These results are useful for decomposing verification of systems where the implementation and the specification are represented as timed I/O automata. We first present a theorem that is applicable in verification tasks in which system specifications express safety...
متن کاملTackling the Dagstuhl'94 Specification Problem with I/o Automata Tackling the Dagstuhl'94 Speciication Problem with I/o Automata
An I/O automata solution to the problem posed by Broy & Lamport at the Dagstuhl Workshop on Reactive Systems is presented. The problem, which concerns components that communicate by means of a procedure interface, consists of an untimed and a timed part. In this paper, both parts are solved completely.
متن کاملWeighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
We consider weighted o-minimal hybrid systems, which extend classical o-minimal hybrid systems with cost functions. These cost functions are “observer variables” which increase while the system evolves but do not constrain the behaviour of the system. In this paper, we prove two main results: (i) optimal o-minimal hybrid games are decidable; (ii) the model-checking of WCTL, an extension of CTL ...
متن کامل